linear search problem造句

The linear search problem for a general probability distribution is unsolved.
The linear search problem was solved by Anatole Beck and Donald J . Newman ( 1970 ) as a two-person zero-sum game.
Beck's work dealt with ergodic theory, topological dynamics, Probability in Banach spaces, measure theory, search theory, linear search problem, and mathematics in the social sciences.
It is also assumed that the searcher cannot see the hider until he actually reaches the point at which the hider is located and the time elapsed until this moment is the duration of the game . " It is obvious that in order to find the hider the searcher has to go a distance x 1 in one direction, return to the origin and go distance x 2 in the other direction etc ., ( the length of the n-th step being denoted by x n ), and to do it in an optimal way . ( However, an optimal solution need not have a first step and could start with an infinite number of small'oscillations'. ) This problem is usually called the linear search problem and a search plan is called a trajectory.
It's difficult to find linear search problem in a sentence. 用linear search problem造句挺难的